Similarity, Self-Similarity and Intermediate Asymptotics
نویسندگان
چکیده
منابع مشابه
Intermediate asymptotics beyond homogeneity and self-similarity: long time behavior for ut = ∆φ(u)
We investigate the long time asymptotics in L+(R) for solutions of general nonlinear diffusion equations ut = ∆φ(u). We describe, for the first time, the intermediate asymptotics for a very large class of non-homogeneous nonlinearities φ for which long time asymptotics cannot be characterized by self-similar solutions. Scaling the solutions by their own second moment (temperature in the kinetic...
متن کاملSelf-similarity networks and self-similarity network group
The self-similarity of complex has extensive practical background in real world. It is similar to the phenomena of social relationships: “things of one kind come together, birds of a feather flock together”. Hence, we proposed the self-similarity network evolving model based on attributes similarity between the nodes. In network each node has the attribute value, by this computing similarity be...
متن کاملSelf-similarity of trailing vortices Self-similarity of trailing vortices
Trailing vortices have been repeatedly shown to exhibit a remarkably robust selfsimilarity independent of the Reynolds number and upstream boundary conditions. The collapse of the inner-scaled circulation profiles of a trailing vortex has even been previously demonstrated for the cases of highly unsteady and turbulent vortex systems, as well as for vortices which were incompletely developed. A ...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملSelf-Similarity of Graphs
An old problem raised independently by Jacobson and Schönheim asks to determine the maximum s for which every graph with m edges contains a pair of edge-disjoint isomorphic subgraphs with s edges. In this paper we determine this maximum up to a constant factor. We show that every m-edge graph contains a pair of edge-disjoint isomorphic subgraphs with at least c(m logm) edges for some absolute c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mechanics
سال: 1981
ISSN: 0021-8936,1528-9036
DOI: 10.1115/1.3157583